2 5 Ju n 20 15 Markov Interacting Importance Samplers

نویسندگان

  • Eduardo F. Mendes
  • Marcel Scharth
  • Robert Kohn
چکیده

We introduce a new Markov chain Monte Carlo (MCMC) sampler called the Markov Interacting Importance Sampler (MIIS). The MIIS sampler uses conditional importance sampling (IS) approximations to jointly sample the current state of the Markov Chain and estimate conditional expectations, possibly by incorporating a full range of variance reduction techniques. We compute Rao-Blackwellized estimates based on the conditional expectations to construct control variates for estimating expectations under the target distribution. The control variates are particularly efficient when there are substantial correlations between the variables in the target distribution, a challenging setting for MCMC. An important motivating application of MIIS occurs when the exact Gibbs sampler is not available because it is infeasible to directly simulate from the conditional distributions. In this case the MIIS method can be more efficient than a Metropolis-within-Gibbs approach. We also introduce the MIIS random walk algorithm, designed to accelerate convergence and improve upon the computational efficiency of standard random walk samplers. Simulated and empirical illustrations for Bayesian analysis show that the method significantly reduces the variance of Monte Carlo estimates compared to standard MCMC approaches, at equivalent implementation and computational effort.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interacting Particle Markov Chain Monte Carlo

We introduce interacting particle Markov chain Monte Carlo (iPMCMC), a PMCMC method based on an interacting pool of standard and conditional sequential Monte Carlo samplers. Like related methods, iPMCMC is a Markov chain Monte Carlo sampler on an extended space. We present empirical results that show significant improvements in mixing rates relative to both noninteracting PMCMC samplers and a s...

متن کامل

Sequential Monte Carlo Samplers for Rare Events

We present novel sequential Monte Carlo (SMC) algorithms for the simulation of two broad classes of rare events which are suitable for the estimation of tail probabilities and probability density functions in the regions of rare events, as well as the simulation of rare system trajectories. These methods have some connection with previously proposed importance sampling (IS) and interacting part...

متن کامل

Perfect simulation for length-interacting polygonal Markov fields in the plane

The purpose of this paper is to construct perfect samplers for length-interacting Arak–Clifford–Surgailis polygonal Markov fields in the plane with nodes of order 2 (V-shaped nodes). This is achieved by providing for the polygonal fields a hard core marked point process representation with individual points carrying polygonal loops as their marks, so that the coupling from the past and clan of ...

متن کامل

Sequence analysis Repulsive parallel MCMC algorithm for discovering diverse motifs from large sequence sets

Motivation: The motif discovery problem consists of finding recurring patterns of short strings in a set of nucleotide sequences. This classical problem is receiving renewed attention as most early motif discovery methods lack the ability to handle large data of recent genome-wide ChIP studies. New ChIP-tailored methods focus on reducing computation time and pay little regard to the accuracy of...

متن کامل

Layered Adaptive Importance Sampling

Monte Carlo methods represent the de facto standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use simpler proposal probability densities for drawing candidate samples. Performance of any such method is strictly related to the specification of the proposal ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015